Ε-calculus Based Axiom Systems for Some Propositional Modal Logics
نویسنده
چکیده
1 Introduction: Instead of considering propositional S4 (say) as a theory built on top of classical propositional logic, we can consider it as the classical first order theory of its Kripke models. This first order theory can be formulated in any of the ways first order theories usually are: tableau, Gentzen system, natural deduction, conventional axiom system, ε-calculus. If the first order theory of Kripke S4 models can be given in a formulation which is technically easy to use, the result is a convenient S4 proof system. Thus, in [2] we gave a tableau formulation of the S4 model theory which dealt automatically with the peculiarities of Kripke models, and produced a proof system for S4 (and similarly for other modal logics) which is simple to apply. In this paper we give what is essentially an ε-calculus formulation of the Kripke model theory of S4 (and S5, T, B, and also first order versions) which also automatically treats the peculiarities of the Kripke models. It is less convenient in use than the tableau system of [2] but still has a curious intrinsic interest.
منابع مشابه
Errata and Addenda to 'Finite non-deterministic semantics for some modal systems'
Trying to overcome Dugundji’s result on uncharacterizability of modal logics by finite logical matrices, J. Kearns (in 1981) and J. Ivlev (in 1988) propose, independently, a characterization of some modal systems by means of four-valued multivalued truth-functions (by restricting the valuations using level valuations, in Kearns’ approach), as an alternative to Kripke semantics. This constitutes...
متن کاملA Note on Some Explicit Modal Logics
Artemov introduced the Logic of Proofs (LP) as a logic of explicit proofs. We can also offer an epistemic reading of this formula: “t is a possible justification of φ”. Motivated, in part, by this epistemic reading, Fitting introduced a Kripke style semantics for LP in [8]. In this note, we prove soundness and completeness of some axiom systems which are not covered in [8].
متن کاملMalinowski modalization, modalization through fibring and the Leibniz hierarchy
We show how various modal systems considered by Malinowski as extensions of classical propositional calculus may be obtained as fibrings of classical propositional calculus and corresponding implicative modal logics, using the fibring framework for combining logics of Fernández and Coniglio. Taking advantage of this construction and known results of Malinowski, we draw some useful conclusions c...
متن کاملModal Satisfiability via SMT Solving
Modal logics extend classical propositional logic, and they are robustly decidable. Whereas most existing decision procedures for modal logics are based on tableau constructions, we propose a framework for obtaining decision procedures by adding instantiation rules to standard SAT and SMT solvers. Soundness, completeness, and termination of the procedures can be proved in a uniform and elementa...
متن کاملCombining Dynamic Logic with Doxastic Modal Logics
We prove completeness and decidability results for a family of combinations of propositional dynamic logic and unimodal doxastic logics in which the modalities may interact. The kind of interactions we consider include three forms of commuting axioms, namely, axioms similar to the axiom of perfect recall and the axiom of no learning from temporal logic and a Church-Rosser axiom. We investigate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 13 شماره
صفحات -
تاریخ انتشار 1972